منابع مشابه
Typing Untyped lambda-Terms, or Reducibility Strikes Again!
It was observed by Curry that when (untyped) λ-terms can be assigned types, for example, simple types, these terms have nice properties (for example, they are strongly normalizing). Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned ...
متن کاملPi Day Is Upon Us Again and We Still Do Not Know if Pi Is Normal
The digits of π have intrigued both the public and research mathematicians from the beginning of time. This article briefly reviews the history of this venerable constant, and then describes some recent research on the question of whether π is normal, or, in other words, whether its digits are statistically random in a specific sense. 1 Pi and its day in modern popular culture The number π, uni...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملConservativity of Embeddings in the lambda Pi Calculus Modulo Rewriting
The λΠ calculus can be extended with rewrite rules to embed any functional pure type system. In this paper, we show that the embedding is conservative by proving a relative form of normalization, thus justifying the use of the λΠ calculus modulo rewriting as a logical framework for logics based on pure type systems. This result was previously only proved under the condition that the target syst...
متن کاملEmbedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2002
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-02-06750-3